/**
 * 二叉链表递归算法创建
 */

#include<stdio.h>
#define ElemType int
#define Status int
#define OK 1
#define ERROR 0
typedef struct BiTree{
    ElemType data;
    struct BiTree* lchild;
    struct BiTree* rchild;
}*BiTree,BiNode;



//创建树 T根
Status CreateBiTee(BiTree* T){
    char ch;
    scanf("%c",&ch);
    if(ch=='#'){
        *T=NULL;
    }
    else{
        T =(BiNode*)malloc(sizeof(BiNode));
        if(T==NULL){

        }
    }

}